Despite their exceptional error-correcting properties, Reed-Solomon (RS)codes have been overlooked in distributed storage applications due to thecommon belief that they have poor repair bandwidth: A naive repair approachwould require the whole file to be reconstructed in order to recover a singleerased codeword symbol. In a recent work, Guruswami and Wootters (STOC'16)proposed a single-erasure repair method for RS codes that achieves the optimalrepair bandwidth amongst all linear encoding schemes. We extend their tracecollection technique to cope with two erasures.
展开▼
